
#include <iostream>
#include <string.h>
#include <algorithm>
using namespace std;

char board[105];
int N, N2, total;
int st = 0;

void print() {
	cout << "step " << st++ << ":";
	for (int i = 1; i <= 2 * N + 2; i++) {
		printf("%c", board[i]);
	}
	printf("\n");
}
void change(int n) {
	for (int i = 0; i < 2; i++) {
		board[total + i] = board[n + i];
		board[n + i] = '-';
	}
	print();
	total = n;

}

void recursive(int n) {
	if (n == 4) {
		change(4);
		change(8);
		change(2);
		change(7);
		change(1);
	}
	else {
		change(n);
		change(2 * n - 1);
		recursive(n - 1);
	}
}

int main()
{

	cin >> N;
	N;
	N2 = N * 2;
	total = N2 + 1;
	for (int i = 1; i <= N2; i++)
	{
		if (i <= N2 / 2)
			board[i] = 'o';
		else
			board[i] = '*';
	}
	total = N2 + 1;
	board[total] = '-';
	board[total + 1] = '-';
	print();
	recursive(N);
	return 0;
}

